Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
681	CS 330 – Spring 2013, Assignment 5 Assignments due at the beginning of class (11AM), Thursday, April 5 Question[removed]pts). Chapter 6, Exercise 8, on p[removed]Question[removed]pts). Chapter 6, Exercise 10, on p[removed]Ques Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-03-21 14:14:43 Analysis of algorithms Algorithm Mathematical logic Partition problem Time complexity NP Theoretical computer science Computational complexity theory Applied mathematics
682	Artificial Intelligence Artificial Intelligence Add to Reading List Source URL: www.cse.unsw.edu.au Language: English - Date: 2009-03-06 00:35:16 NP-complete problems Complexity classes Operations research Combinatorial optimization Travelling salesman problem Optimization problem NP Branch and bound Mathematical optimization Theoretical computer science Computational complexity theory Applied mathematics
683	400 USC College of Letters, Arts and Sciences Major Requirements for the Bachelor of Arts in Applied and Computational Add to Reading List Source URL: www.usc.edu Language: English - Date: 2009-11-03 14:16:17 Differential equations Fourier analysis Algebra Linear algebra Fourier transform Partial differential equation Ordinary differential equation Integral transform Elliptic boundary value problem Mathematical analysis Mathematics Functional analysis
684	Georgia Perimeter College Common Course Outline Course Abbreviation & Number: Math 2420 Add to Reading List Source URL: www.gpc.edu Language: English - Date: 2012-02-09 09:25:38 Graph Discrete mathematics Combinatorics Binary relation Emmy Noether Model theory Conjectures P versus NP problem Computational complexity theory Mathematics Graph theory Function
685	ABRAHAM FLAXMAN, Carnegie Mellon University, Pittsburgh, PA, USA On the Average Case Performance of Some Greedy Approximation Algorithms for the Uncapacitated Facility Location Problem In combinatorial optimization, a po Add to Reading List Source URL: cms.math.ca Language: English - Date: 2006-07-10 21:18:20 Computational complexity theory Operations research Approximation algorithm Asymptotically optimal algorithm Algorithm Optimization problem Combinatorial optimization Facility location Greedy algorithm Theoretical computer science Applied mathematics Mathematics
686	"Relative Utility of Deductive and Inductive Logic": Conference on Logic and Liberal Learning, 1979 Box 51, Folder 10 Wesley C. Salmon Papers, [removed], ASP[removed], Archives of Scientific Philosophy, Special Collection Add to Reading List Source URL: digital.library.pitt.edu Language: English - Date: 2013-06-01 23:00:28 Epistemology Philosophy Inductive reasoning Problem solving Reasoning Statistical inference Logic Mathematical logic Computational epistemology Science Knowledge Philosophy of science
687	Approximation Algorithms for Stochastic Orienteering Anupam Gupta∗ Ravishankar Krishnaswamy† Viswanath Nagarajan‡ Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2011-09-30 21:07:28 Combinatorial optimization NP-complete problems Operations research Cryptography Knapsack problem Approximation algorithm Linear programming relaxation SL Matching Theoretical computer science Computational complexity theory Applied mathematics
688	Computational Complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas Inaugural-Dissertation zur Erlangung des Doktorgrades Add to Reading List Source URL: kups.ub.uni-koeln.de Language: English - Date: 2011-03-28 06:57:24 NP-complete problems Logic in computer science Complexity classes Boolean algebra 2-satisfiability Boolean satisfiability problem Conjunctive normal form Outerplanar graph Planar graph Theoretical computer science Graph theory Computational complexity theory
689	Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication Add to Reading List Source URL: www.econ.brown.edu Language: English - Date: 2013-06-19 07:39:31 Complexity classes NP-complete problems Mathematical optimization Structural complexity theory NP-complete NP-hard P versus NP problem NP Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
690	An E cient Mean Field Annealing Formulation for Mapping Unstructured? Domains to Hypercubes Cevdet Aykanat and I_smail Haritaoglu Computer Engineering Department, Bilkent University, Ankara, Turkey [removed] Add to Reading List Source URL: www.cs.bilkent.edu.tr Language: English - Date: 2006-07-06 10:53:25 NP-complete problems Cubes Hypercube Parallel computing Shortest path problem Heuristic Graph partition Algorithm Mathematics Theoretical computer science Computational complexity theory

UPDATE